منابع مشابه
Parsing MELL proof nets
We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar deened by such a rewriting system (connuent and strong normalizing on the new proof nets) gives a correctness criterion that we s h o w equivalent to the Danos-Regnier one.
متن کاملParsing MELL Proof Nets 1
We propose a rewriting system for parsing full multiplicative and exponential proof structures. The recognizing grammar deened by such a rewriting system (connuent and strong normalizing) gives a correctness criterion that we show equivalent to the Danos-Regnier one.
متن کاملUniversit a Di Pisa Parsing Mell Proof Nets Parsing Mell Proof Nets
We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar deened by such a rewriting system (connuent and strong normalizing on the new proof nets) gives a correctness criterion that we show equivalent to the Danos-Regnier one.
متن کاملTowards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actually a mere conservative extension of the earlier method of syntactic connexion, discovered by Ajduckiewicz [1935]. The method amounts to find alternating spanning trees in graphs. A sketch of an algorithm for finding s...
متن کاملPolarized Proof-Nets: Proof-Nets for LC
We deene a notion of polarization in linear logic (LL) coming from the polarities of Jean-Yves Girard's classical sequent calculus LC 4]. This allows us to deene a translation between the two systems. Then we study the application of this polarization constraint to proof-nets for full linear logic described in 7]. This yields an important simpli-cation of the correctness criterion for polarized...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00299-6